Generalized Partitioned Quantum Cellular Automata and Quantumization of Classical CA
نویسندگان
چکیده
J. Watrous introduced the notion of quantum cellular automata(QCA) and showed that any quantum Turing machine can be efficiently simulated by a QCA with constant slowdown in 1995. CA with quantum cells is well-formed QCA if and only if its global transition function is unitary. Generally quantumization of cells of a classical CA dose not make it become QCA, because usually classical CA dose not have reversibility. Morita and Harao show that we can get reversible CA by partition a cell into three part and partitioned CA(PCA) can simulate non-partitioned CA(NPCA)[10]. But there is not a trivial inclusion relation between PCA and NPCA. In this paper, we introduce a new formulation of finite cyclic QCA and generalized notion of partitioned QCA in order to investigate natural transformations from discrete CA to QCA. According to the formulations, we demonstrate a condition of a local transition function, which induce a well-formed QCA. A natural correspondence of classical cells and quantum cells can be extended to the correspondence of classical CA and QCA. If a classical CA satisfies our conditions then the extended QCA is well-formed. Finally we report some results of computer simulations of quantumization of classical CA.
منابع مشابه
Generalized Partitioned Quantum Cellular Automata and Quantization of Classical CA
In this paper, in order to investigate natural transformations from discrete CA to QCA, we introduce a formulation of finite cyclic QCA and generalized notion of partitioned QCA. According to the formulations, we demonstratethe condition of local transition functions, which induce a global transition of well-formed QCA. Following the results, extending a natural correspondence of classical cell...
متن کاملDesign of low power random number generators for quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are a promising nanotechnology to implement digital circuits at the nanoscale. Devices based on QCA have the advantages of faster speed, lower power consumption, and greatly reduced sizes. In this paper, we are presented the circuits, which generate random numbers in QCA. Random numbers have many uses in science, art, statistics, cryptography, gaming, gambli...
متن کاملNovel Phase-frequency Detector based on Quantum-dot Cellular Automata Nanotechnology
The electronic industry has grown vastly in recent years, and researchers are trying to minimize circuits delay, occupied area and power consumption as much as possible. In this regard, many technologies have been introduced. Quantum Cellular Automata (QCA) is one of the schemes to design nano-scale digital electronic circuits. This technology has high speed and low power consumption, and occup...
متن کاملTwo Novel D-Flip Flops with Level Triggered Reset in Quantum Dot Cellular Automata Technology
Quantum dot cellular automata (QCA) introduces a pioneer technology in nano scale computer architectures. Employing this technology is one of the solutions to decrease the size of circuits and reducing power dissipation. In this paper, two new optimized FlipFlops with reset input are proposed in quantum dot cellular automata technology. In addition, comparison with related works is performed.Th...
متن کاملNovel efficient fault-tolerant full-adder for quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are an emerging technology and a possible alternative for semiconductor transistor based technologies. A novel fault-tolerant QCA full-adder cell is proposed: This component is simple in structure and suitable for designing fault-tolerant QCA circuits. The redundant version of QCA full-adder cell is powerful in terms of implementing robust digital functions. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005